package com.wc.AlgoOJ_train.train1.c0.A012;

import java.io.PrintWriter;
import java.util.Scanner;

/**
 * @Author congge
 * @Date 2023/12/25 10:42
 * @description 偶数求和
 * http://43.138.190.70:8888/p/A012
 */
public class Main {
    static PrintWriter out = new PrintWriter(System.out);
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int start = 2;
            int n = sc.nextInt();
            int m = sc.nextInt();
            int[] arr = new int[100];
            int idx = 0;
            int i;
            for (i = m; i < n; i += m) {
                arr[idx++] = start + (m - 1);
                start += m * 2;
            }
            if (i - n >= 0) {
                int re = n - (i - m);
                arr[idx++] = start + (re - 1) ;
            }
            out.print(arr[0]);
            for (int j = 1; j < idx; j++) {
                out.print(" ");
                out.print(arr[j]);
            }
            out.println();
            out.flush();
        }
    }
}
